On Finding the Eigenvalues of Real Symmetric Tridiagonal Matrices
نویسندگان
چکیده
منابع مشابه
Eigenvalues of symmetric tridiagonal interval matrices revisited
In this short note, we present a novel method for computing exact lower and upper bounds of a symmetric tridiagonal interval matrix. Compared to the known methods, our approach is fast, simple to present and to implement, and avoids any assumptions Our construction explicitly yields those matrices for which particular lower and upper bounds are attained.
متن کاملUsing GPUs to Accelerate the Bisection Algorithm for Finding Eigenvalues of Symmetric Tridiagonal Matrices
Graphical Processing Units (GPUs) potentially promise widespread and inexpensive high performance computation. However, architectural limitations (only some operations and memory access patterns can be performed quickly, partial support for IEEE floating point arithmetic) make it necessary to change existing algorithms to attain high performance and correctness. Here we show how to make the bis...
متن کاملExtreme eigenvalues of real symmetric Toeplitz matrices
We exploit the even and odd spectrum of real symmetric Toeplitz matrices for the computation of their extreme eigenvalues, which are obtained as the solutions of spectral, or secular, equations. We also present a concise convergence analysis for a method to solve these spectral equations, along with an efficient stopping rule, an error analysis, and extensive numerical results.
متن کاملBounds on the Extreme Eigenvalues of Real Symmetric Toeplitz Matrices
We derive upper and lower bounds on the smallest and largest eigenvalues, respectively, of real symmetric Toeplitz matrices. The bounds are rst obtained for positive-deenite matrices and then extended to the general real symmetric case. Our bounds are computed as the roots of rational and polynomial approximations to spectral, or secular, equations. The decomposition of the spectrum into even a...
متن کاملReal symmetric matrices 1 Eigenvalues and eigenvectors
A matrix D is diagonal if all its off-diagonal entries are zero. If D is diagonal, then its eigenvalues are the diagonal entries, and the characteristic polynomial of D is fD(x) = ∏i=1(x−dii), where dii is the (i, i) diagonal entry of D. A matrix A is diagonalisable if there is an invertible matrix Q such that QAQ−1 is diagonal. Note that A and QAQ−1 always have the same eigenvalues and the sam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1966
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/9.1.98